New constructions of low-correlation sequences with high-linear complexity
نویسندگان
چکیده
منابع مشابه
New constructions of low-correlation sequences with high-linear complexity
In this paper, we propose a new concept named similar-bent function and we present two general methods to construct balanced sequences with low correlation by using similar-bent functions and orthogonal similar-bent functions. We find that the bent sequence sets are special cases of our construction. We also investigate the linear complexity of the new constructed sequences. If a suitable simil...
متن کاملNew Constructions of Optimal Binary Low Correlation Zone Sequences
In this paper, we propose new methods of constructing optimal binary low correlation zone (LCZ) sequences. In the new method, we devise a column sequence set of length 2 − 1 from a binary sequence of period 2 − 1 having ideal autocorrelation property and this column sequence set is used to construct binary LCZ sequence sets of period 2− 1 when (m+1)|n. The new method gives us the optimal sets w...
متن کاملNew Binary Sequences of Period pq with Low Values of Correlation and Large Linear Complexity
Many new binary sequences are obtained from Jacobi sequences with arbitrary starting points and investigated from the cryptographic viewpoint. Autocorrelation values of these new sequences and cross-correlation values between of them are calculated. The results show that these values may be very low and distributed flatly under certain conditions. Linear complexity of them can be proved always ...
متن کاملNew Constructions of Binary Interleaved Sequences with Low Autocorrelation
The autocorrelation of a key stream sequence in a stream cipher is an important cryptographic property. This paper proposes two constructions of binary interleaved sequences of period 4N by selecting appropriate shift sequences, subsequences and complement sequences. And the autocorrelation functions of new sequences are given. The results show that these sequences have low autocorrelation unde...
متن کاملFamilies of p-ary sequences with low correlation and large linear complexity
This paper generalizes a method of generating shift sequences in the interleaved construction proposed by Gong. With the new shift sequences, some new families of p-ary sequences with desired properties can be obtained. A lower bound on the number of new families of binary sequences is also established.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IET Communications
سال: 2012
ISSN: 1751-8628,1751-8636
DOI: 10.1049/iet-com.2012.0126